SwePub
Tyck till om SwePub Sök här!
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "db:Swepub ;pers:(Jantsch Axel);pers:(Zhou Dian)"

Sökning: db:Swepub > Jantsch Axel > Zhou Dian

  • Resultat 1-7 av 7
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • She, Huimin, et al. (författare)
  • A Network-based System Architecture for Remote Medical Applications
  • 2007
  • Ingår i: Proceedings of the Asia-Pacific Advanced Network Meeting.
  • Konferensbidrag (refereegranskat)abstract
    • Nowadays, the evolution of wireless communication and networktechnologies enables remote medical services to be availableeverywhere in the world. In this paper, a network-based systemarchitecture adopting wireless personal area network (WPAN)protocol IEEE 802.15.4/Zigbee standard and 3G communicationnetworks for remote medical applications is proposed. In theproposed system, the number and type of medical sensors arescalable depending on individual needs. This feature allows thesystem to be flexibly applied in several medical applications.Furthermore, a differentiated service using priority scheduling anddata compression is introduced. This scheme can not only reducetransmission delay for critical physiological signals and enhancebandwidth utilization at the same time, but also decrease powerconsumption of the hand-held personal server which uses batteryas the energy source.
  •  
2.
  • She, Huimin, et al. (författare)
  • Analysis of Traffic Splitting Mechanisms for 2D Mesh Sensor Networks
  • 2008
  • Ingår i: International Journal of Software Engineering and Its Applications. - 1738-9984. ; 2:3
  • Tidskriftsartikel (refereegranskat)abstract
    • For many applications of sensor networks, it is essential to ensure that messages aretransmitted to their destinations within delay bounds and the buffer size of each sensor nodeis as small as possible. In this paper, we firstly introduce the system model of a mesh sensornetwork. Based on this system model, the expressions for deriving the delay bound and bufferrequirement bound are presented using network calculus theory. In order to balance trafficload and improve resource utilization, three traffic splitting mechanisms are proposed. Andthe two bounds are derived in these traffic splitting mechanisms. To show how our methodapplies to real applications, we conduct a case study on a fresh food tracking application,which monitors the food freshness status in real-time during transportation. The numericalresults show that the delay bound and buffer requirement bound are reduced while applyingtraffic splitting mechanisms. Thus the performance of the whole sensor network is improvedwith less cost.
  •  
3.
  • She, Huimin, et al. (författare)
  • Analytical Evaluation of Retransmission Schemes in Wireless Sensor Networks
  • 2009
  • Ingår i: 2009 IEEE VEHICULAR TECHNOLOGY CONFERENCE. - 9781424425167 ; , s. 38-42
  • Konferensbidrag (refereegranskat)abstract
    • Retransmission has been adopted as one of the most popular schemes for improving transmission reliability in wireless sensor networks. Many previous works have been done on reliable transmission issues in experimental ways, however, there still lack of analytical techniques to evaluate these solutions. Based on the traffic model, service model and energy model, we propose an analytical method to analyze the delay and energy metrics of two categories of retransmission schemes: hop-by-hop retransmission (HBH) and end-to-end retransmission (ETE). With the experiment results, the maximum packet transfer delay and energy efficiency of these two scheme are compared in several scenarios. Moreover, the analytical results of transfer delay are validated through simulations. Our experiments demonstrate that HBH has less energy consumption at the cost of lager transfer delay compared with ETE. With the same target success probability, ETE is superior on the delay metric for low bit-error-rate (BER) cases, while HBH is superior for high BER cases.
  •  
4.
  • She, Huimin, et al. (författare)
  • Modeling and Analysis of Rayleigh Fading Channels using Stochastic Network Calculus
  • 2011
  • Konferensbidrag (refereegranskat)abstract
    • Deterministic network calculus (DNC) is not suitable for deriving performance guarantees for wireless networks due to their inherently random behaviors. In this paper, we develop a method for Quality of Service (QoS) analysis of wireless channels subject to Rayleigh fading based on stochastic network calculus. We provide closed-form stochastic service curve for the Rayleigh fading channel. With this service curve, we derive stochastic delay and backlog bounds. Simulation results verify that the bounds are reasonably tight. Moreover, through numerical experiments, we show the method is not only capable of deriving stochastic performance bounds, but also can provide guidelines for designing transmission strategies in wireless networks.
  •  
5.
  • She, Huimin, et al. (författare)
  • Performance Analysis of Flow-Based Traffic Splitting Strategy on Cluster-Mesh Sensor Networks
  • 2012
  • Ingår i: International Journal of Distributed Sensor Networks. - : Hindawi Publishing Corporation. - 1550-1329 .- 1550-1477. ; , s. 232937-
  • Tidskriftsartikel (refereegranskat)abstract
    • Performance analysis is crucial for designing predictable and cost-efficient sensor networks. Based on the network calculus theory, we propose a flow-based traffic splitting strategy and its analytical method for worst-case performance analysis on cluster-mesh sensor networks. The traffic splitting strategy can be used to alleviate the problem of uneven network traffic load. The analytical method is able to derive close-form formulas for the worst-case performance in terms of the end-to-end least upper delay bounds for individual flows, the least upper backlog bounds, and power consumptions for individual nodes. Numerical results and simulations are conducted to show benefits of the splitting strategy as well as validate the analytical method. The numerical results show that the splitting strategy enables much better balance on network traffic load and power consumption. Moreover, the simulation results verify that the theoretic bounds are fairly tight.
  •  
6.
  • She, Huimin, et al. (författare)
  • Stochastic Coverage in Event-Driven Sensor Networks
  • 2011
  • Ingår i: 2011 IEEE 22nd International Symposium On Personal Indoor And Mobile Radio Communications (PIMRC). - New York : IEEE. - 9781457713484 ; , s. 915-919
  • Konferensbidrag (refereegranskat)abstract
    • One of the primary tasks of sensor networks is to detect events in a field of interest (FoI). To quantify how well events are detected in such networks, coverage of events is a fundamental problem to be studied. However, traditional studies mostly focus on analyzing the coverage of the FoI, which is usually called are a coverage. In this paper, we propose an analytic method to evaluate the performance of event coverage in sensor networks with randomly deployed sensor nodes and stochastic event occurrences. We provide formulas to calculate the probabilities of event coverage and event missing. The numerical results show how these two probabilities change with the sensor and event densities. Moreover, simulations are conducted to validate the analytic method. This method can provide guidelines for determining the amount of sensor nodes to achieve a certain level of coverage in event-driven sensor networks.
  •  
7.
  • She, Huimin, et al. (författare)
  • Traffic splitting with network calculus for mesh sensor networks
  • 2007
  • Ingår i: Proceedings of Future Generation Communication and Networking, FGCN 2007. - : IEEE Computer Society. - 9780769530482 ; , s. 371-376
  • Konferensbidrag (refereegranskat)abstract
    • In many applications of sensor networks, it is essential to ensure that messages are transmitted to their destinations as early as possible and the buffer size of each sensor node is as small as possible. In this paper, we firstly propose a mesh sensor network system model. Based on this system model, the expressions for deriving the delay bound and buffer requirement bound are presented using network calculus. In order to balance traffic load and improve resource utilization, three traffic splitting mechanisms are proposed The numerical results show that the delay bound and buffer requirement bound are lowered while applying those traffic splitting mechanisms. And thus the performance of the whole sensor network is improved.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-7 av 7
Typ av publikation
konferensbidrag (5)
tidskriftsartikel (2)
Typ av innehåll
refereegranskat (7)
Författare/redaktör
Lu, Zhonghai (7)
She, Huimin (7)
Zheng, Li-Rong (4)
Zheng, Lirong (3)
Lärosäte
Kungliga Tekniska Högskolan (7)
Språk
Engelska (7)
Forskningsämne (UKÄ/SCB)
Teknik (7)
Naturvetenskap (2)

År

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy